Convergence analysis of Lanczos-type methods for the linear response eigenvalue problem
نویسندگان
چکیده
منابع مشابه
Convergence analysis of Lanczos-type methods for the linear response eigenvalue problem
Two different Lanczos-type methods for the linear response eigenvalue problem are analyzed. The first one is a natural extension of the classical Lanczos method for the symmetric eigenvalue problem while the second one was recently proposed by Tsiper specially for the linear response eigenvalue problem. Our analysis leads to bounds on errors for eigenvalue and eigenvector approximations by the ...
متن کاملConvergence of the block Lanczos method for eigenvalue clusters
The Lanczos method is often used to solve a large scale symmetric matrix eigen-value problem. It is well-known that the single-vector Lanczos method can only find one copy of any multiple eigenvalue and encounters slow convergence towards clustered eigenvalues. On the other hand, the block Lanczos method can compute all or some of the copies of a multiple eigenvalue and, with a suitable block s...
متن کاملConvergence of Block Lanczos Method for Eigenvalue Clusters
The Lanczos method is often used to solve a large and sparse symmetric matrix eigenvalue problem. It is well-known that the single-vector Lanczos method can only find one copy of any multiple eigenvalue. To compute all or some of the copies of a multiple eigenvalue, one has to use the block Lanczos method which is also known to compute clustered eigenvalues much faster than the single-vector La...
متن کاملConvergence Analysis of Gradient Iterations for the Symmetric Eigenvalue Problem
Gradient iterations for the Rayleigh quotient are simple and robust solvers to determine a few of the smallest eigenvalues together with the associated eigenvectors of (generalized) matrix eigenvalue problems for symmetric matrices. Sharp convergence estimates for the Ritz values and Ritz vectors are derived for various steepest descent/ascent gradient iterations. The analysis shows that poores...
متن کاملRayleigh-Ritz Approximation For the Linear Response Eigenvalue Problem
Large scale eigenvalue computation is about approximating certain invariant subspaces associated with the interested part of the spectrum, and the interested eigenvalues are then extracted from projecting the problem by approximate invariant subspaces into a much smaller eigenvalue problem. In the case of the linear response eigenvalue problem (aka the random phase eigenvalue problem), it is th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computational and Applied Mathematics
سال: 2013
ISSN: 0377-0427
DOI: 10.1016/j.cam.2013.01.003